Uncoercible Anonymous Electronic Voting

نویسندگان

  • Chun-I Fan
  • Wei-Zhe Sun
چکیده

Due to convenience and efficiency, electronic voting (e-voting) techniques gradually replace traditional paper-based voting activities in some developed countries. A secure anonymous e-voting system has to satisfy many properties, such as completeness, tally correctness, and uncoercibility, where the uncoercibility property is the most difficult one to be achieved. Since each voter can obtain a voting receipt in an electronic voting system, coercibility and bribe (vote-buying and vote-selling are included) become more and more serious in electronic voting environments than traditional paper-based voting environments. Unfortunately, most of the solutions, like receipt-freeness or untappable channels, proposed in the literature, are impractical owing to lack of efficiency or too complicated to be implemented. It will make uncoercible e-voting systems unacceptable by the people. In order to cope with the drawbacks of the previous schemes, this paper will present a generic idea, which is independent of the underlying cryptographic components, on electronic voting to achieve the uncoercibility property and other requirements. The proposed method is an efficient and quite practical solution to match the current environments of electronic voting.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uncoercible e-Bidding Games

The notion of uncoercibility was first introduced in e-voting systems to deal with the coercion of voters. However this notion extends to many other esystems for which the privacy of users must be protected, even if the users wish to undermine their own privacy. In this paper we consider uncoercible e-bidding games. We discuss necessary requirements for uncoercibility, and present a general unc...

متن کامل

An Uncoercible Veriiable Electronic Voting Protocol

In this paper we present a veriiable voting protocol which removes the possibility of massive coercion or vote buying. In contrast with other previous proposals, in our protocol the mobility of voters is not restricted in any way, keeping the voting scheme as a real network application. This is achieved through the use of tamper-resistant smartcards and the involvement of a Trusted Third Party.

متن کامل

Cryptographically verifiable anonymous voting using pan-european e-IDs

In this paper we explore a method to create anonymous services on top of the STORK framework, to be used for electronic surveys or elections. The STORK project aims to realize a single electronic identification and authentication area across Europe. For verifiable and anonymous voting, users should be authenticated with their e-id (to prevent repeated voting) but the votes should also be anonym...

متن کامل

Practical Approach to Anonymity in Large Scale Electronic Voting Schemes

Anonymity of ballots in electronic voting schemes usually relies on the existence of some kind of anonymous channel between voters and ballot collecting authorities. Currently, there exist solutions based on the mix concept, which allow for anonymous e-mail communications. However, integration of such solutions into the implementation of a voting scheme has some problems. In this paper we propo...

متن کامل

An Anonymous Electronic Voting Protocol with the Latest Decision on Voters' Intentions

In most of the anonymous electronic voting schemes presented in the literature, every voter must decide his intention for a voting before the tally center performs the signing operation on his vote. In these schemes, voters cannot modify or update their intentions embedded in the signed votes even if they have not been sent to the tally center for tallying yet. This paper presents a new anonymo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006